| 1. | Open shortest path first other file
开放系统最短路径优先 |
| 2. | Dijkstra ' s shortest path first algorithm
最短路径算法 |
| 3. | Open shortest path first protocol
优先开放最短路径 |
| 4. | Open shortest path first
开放最短路径优先协议 |
| 5. | Spf shortest path first
最短路径优先 |
| 6. | Ospf ( open shorted path first ) and is - is ( inter - domain system - inter - domain system ) , relating to routing ; and lmp , relating to link management
关于路由的ospf (开放最短路径优先)协议和is - is （域间系统?域间系统）协议； |
| 7. | Open shortest path first ( ospf ) is one of the routing protocol of internet . originally , it was developed to be the substitute for routing information protocol ( rip )
Ospf ( openshortestpathfirst ，开放最短路径优先)是internet路由选择协议的一种，最初是为替代rip协议开发的，目前已成为构建大型网络最常用的路由选择协议。 |
| 8. | Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由于qos组播路由带有多个qos约束参数，因此qos组播路由问题是一个np完全问题，这使得它与传统的路由过程不同，难以用经典的最短路径优先算法求解。 |
| 9. | We presented an an model in this article . it based on the current structure of plan network , which use cost to instead of the hops to compute network path length and realize the route rule of shortest path first ( spf )
因此，在本文中提出了一个基于plan网络的现有架构，以开销( cost )代替跃点( hops )计数计算网络路径长度，实现最短路径优先( shortestpathfirst ， spf )路由规则的主动网络模型。 |
| 10. | This paper introduced the development of routing protocol , isolation technology , and then introduced the research scope of isolation technology around the world . and then analyzed the ospf ( open shortest path first ) protocol , introduced the routing hierarchy feature of it , analyzed the diffuse process , and the theory of how it works
本文介绍了路由协议、隔离技术的发展,并介绍了国内外在隔离技术中的研究方向,接着分析了ospf路由协议,介绍了ospf分层路由的概念,详细分析了ospf路由协议的扩散过程和工作原理。 |
